A General Decomposition Theorem for the k-Server Problem
نویسندگان
چکیده
منابع مشابه
A General Decomposition Theorem for the k-Server Problem
The first general decomposition theorem for the k-server problem is presented. Whereas all previous theorems are for the case of a finite metric with k + 1 points, the theorem given here allows an arbitrary number of points in the underlying metric space. This theorem implies O(polylog(k))-competitive algorithms for certain metric spaces consisting of a polylogarithmic number of widely separate...
متن کاملThe k-server problem
The k-server problem is perhaps the most influential online problem: natural, crisp, with a surprising technical depth that manifests the richness of competitive analysis. The k-server conjecture, which was posed more that two decades ago when the problem was first studied within the competitive analysis framework, is still open and has been a major driving force for the development of the area...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe Delayed k-Server Problem
We introduce a new version of the server problem: the delayed server problem. In this problem, once a server moves to serve a request, it must wait for one round to move again, but could serve a repeated request to the same point. We show that the delayed k-server problem is equivalent to the (k − 1)-server problem in the uniform case, but not in general.
متن کاملThe Harmonic Algorithm for k - server Problem
The online k-server problem was introduced by Manasse. We are given initial locations of k servers in a matric space in which there is a distant function d.Requests for service at point {xt} come in over time. Immediately after the tth request is received, one of the servers must be moved from its location to xt. An online k-server algorithm makes the choice of which server is moved in each ste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2002.3144